Leader Election using Modified Heap Tree Method
نویسندگان
چکیده
منابع مشابه
Leader Election Algorithm Using Heap Structure
Several distributed algorithms require that there be a coordinator process in the entire system. Since all other processes in the system have to interact with the coordinator, they all must agree on who the coordinator is. Furthermore, if the coordinator process fails due to the failure of the site on which it is located, a new coordinator process must be elected to take up the job of the faile...
متن کاملLeader Election Algorithm in Wireless Environments Using Fibonacci Heap Structure
Today is an era of wireless communication systems. The day is not so far when the whole distributed system of the world will goes wireless. Leader in a distributed system plays a vital role in various computing environments like wireless networks etc. The main focus of researchers is on electing a new leader with lesser time consumption and with transmitting minimum number of messages in the ne...
متن کاملA Modified Leader Election Algorithm for MANET
Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network ...
متن کاملA Self-Stabilizing Leader Election Algorithm for Tree Graphs
We propose a self stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.
متن کاملDistributed protocols for spanning tree construction and leader election
We present fast deterministic distributed protocols in synchronous networks for leader election and spanning tree construction. The protocols are designed under the assumption that nodes in a network have identifiers but the size of an identifier is unlimited. So time bounds of protocols depend on the sizes of identifiers. Depending on a type of a protocol, we present protocols running in time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/7797-0913